Skip list - PDFSEARCH.IO - Document Search Engine

Skip list
Results: 47

#	Item
11	CCCG 2011, Toronto ON, August 10–12, 2011 Orthogonal Range Search using a Distributed Computing Model Pouya Bisadi∗ Abstract Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:12 Skip graph Distributed hash table Skip list Connectivity Linked list Node Chord Bin Koorde Distributed data storage Computing Computer programming
12	PDF Document Add to Reading List Source URL: www.cs.jhu.edu Language: English - Date: 2007-10-09 11:19:08 Data management Distributed data storage B-tree Chord Skip list Rope Connectivity Koorde Ternary tree Binary trees Computing Computer programming
13	bw-tree-icde2013-camera-ready.dvi Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2013-01-20 16:49:28 B-tree Data B+ tree Trie CPU cache Extensible Storage Engine Cache Skip list T-tree Computing Data management Binary trees
14	A Provably Correct Scalable Concurrent Skip List Maurice Herlihy1,2 , Yossi Lev1,2 , Victor Luchangco2 , and Nir Shavit2 1 2 Add to Reading List Source URL: www.cs.tau.ac.il Language: English - Date: 2007-02-18 04:19:12 Skip list Hazard pointer Software engineering Binary trees Binary search tree B-tree Linked lists Computer programming Computing
15	Dynamic algorithms for geometric spanners of small diameter: Randomized solutions Sunil Arya 1 Department of Computer Science, Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hongkong. Add to Reading List Source URL: www.cse.ust.hk Language: English - Date: 2006-04-07 01:20:42 Mathematics Dimension Euclidean plane geometry Estimation theory Statistical theory Computing Geometric spanner Proximity problems Skip list
16	Skip Lists: A Probabilistic Alternative to Balanced Trees Skip lists are a data structure that can be used in place of balanced trees. Skip lists use probabilistic balancing rather than strictly enforced balancing and as Add to Reading List Source URL: www.cl.cam.ac.uk Language: English - Date: 2006-05-29 09:55:51 Computer programming Skip list Linked list Splay tree Binary search tree Tree traversal Self-balancing binary search tree Treap Quicksort Binary trees Graph theory Computing
17	COMS21103 Skip lists and other search structures Ashley Montanaro Department of Computer Science, University of Bristol Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-01-08 09:09:08 Linked lists Database management systems Database theory Skip list Database index Database SQL Data management Computing Data
18	Auction List[removed]North Eden Timber Lot 203: Forest Red Gum 90x35 Skip Dressed (High Feature) 245/lm Lot 204: Yellow Stringybark 50x30 Dressed 428/lm Add to Reading List Source URL: www.northedentimber.com.au Language: English - Date: 2014-11-02 02:39:31 Land lot Knowledge Real estate Language 5X Lumber Ironbark
19	Overview of Certification Systems: X.509, PKIX, CA, PGP & SKIP Do you understand digital certificates? Do you know what they warrant? by Ed Gerck, Ph.D.* Cryptography and certification are necessary Internet features and Add to Reading List Source URL: nma.com Language: English - Date: 2000-07-14 07:25:32 Cryptographic protocols Electronic commerce Computer security X.509 Certificate authority Public key certificate Root certificate Revocation list X.500 Cryptography Public-key cryptography Key management
20	Skip Lists: A Probabilistic Alternative to Balanced Trees Skip lists are a data structure that can be used in place of balanced trees. Skip lists use probabilistic balancing rather than strictly enforced balancing and as Add to Reading List Source URL: www.epaperpress.com Language: English - Date: 2006-11-06 09:35:09 Computer programming Skip list Linked list Splay tree Binary search tree Tree traversal Self-balancing binary search tree Treap Quicksort Binary trees Graph theory Computing

UPDATE